#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 3e6+10;
double ans[maxn];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,m,k;
		int cnt = 0;
		scanf("%d %d %d",&n,&m,&k);
		int a = (n+m)/2;
		int b = n;
		int flag = 0;
		double t = 1.0*k;
		if(a==k) 
		{
			printf("2\n");
			continue;
		}
		if(b==k) 
		{
			printf("1\n");
			continue;
		}
		for(int i = 3;;i += 2)
		{
			double g = 1.0*i;
			double f = (1.0*(m+n))*(g-1.0)/2;
			f = ((1.0*n)+f)/g;
			//printf("****%lf\n",f);
			ans[cnt] = f;
			cnt++;
			if(f-t<0) 
			{
				
				flag = cnt;
				break;
			}
		}
		if(cnt==1) printf("3\n");
		else if(ans[flag-2]-t<=t-ans[flag-1])
		{
			printf("%d\n",2*(flag-1)+1);
		}
		else printf("%d\n",2*flag+1);
	}
} 
